Degrees, Neighbourhoods, and Closure Operations
نویسنده
چکیده
Closure theorems in graph theory are of the following type: Let G be a graph, P a graph theoretic property, and let u and v be two non-adjacent vertices of G. If condition c(u, v) holds, then G has property P if and only if G+ uv has P. We discuss several such results of the above type where the condition c(u, v) refers to neighbourhood properties of u and v.
منابع مشابه
Appraisal of compliance with land subdivision planning regulations in residential neighbourhoods
Although previous studies have attempted to address the challenge of land subdivision, there is still a scarcity in the literature on how the extent of conformity to land subdivision planning regulations may be statistically and spatially analyzed. This study, therefore, explores the extent to which residential developers comply with land subdivision planning regulations in Kenya, a case study ...
متن کاملTopics on the Ratliff-Rush Closure of an Ideal
Introduction Let be a Noetherian ring with unity and be a regular ideal of , that is, contains a nonzerodivisor. Let . Then . The :union: of this family, , is an interesting ideal first studied by Ratliff and Rush in [15]. The Ratliff-Rush closure of is defined by . A regular ideal for which is called Ratliff-Rush ideal. The present paper, reviews some of the known prop...
متن کاملCycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
We propose new cycle-based neighbourhood structures for meta-heuristics aimed at the fixedcharge capacitated multicommodity network design formulation. The neighbourhood defines moves that take explicitly into account the impact on the total design cost of potential modifications to the flow distribution of several commodities simultaneously. Moves are identified through a shortest path-like ne...
متن کاملMorphological Operations in Recursive Neighbourhoods
This paper discusses the use of recursive neighbourhoods in mathematical morphology. Its two notable applications are the recursive erosion/dilation, as well as the detection of foreground–background changes to be used in skeletonization. The benefit of the latter over the use of sub-cycles or an extension of the neighbourhood is emphasized. Two applications are presented that use the recursive...
متن کاملClosure Systems and Closure Operations in Dedekind
The concepts of closure systems and closure operations in lattice theory are basic and applied to many fields in mathematics and theoretical computer science. In this paper authors find out a suitable definition of closure systems in Dedekind categories, and thereby give an equivalence proof for closure systems and closure operations in Dedekind categories.
متن کامل